Performance evaluation of scheduling precedence-constrained computations on message-passing systems

Performance Evaluation of Scheduling Precedence-Constained Computations on Message-Passing Systems

Scheduling precedence graphs with communication times is the theoretical basis for achieving efficient parallelism in message-passing machines. The lack of global information on the tasks, due to communication, has lead to develop local scheduling heuristics such as the Earliest-Task-First. Using knowledge on computation, communication, and system topology, a class of global priority-based sche...

Communication and Matrix Computations on Large Message Passing Systems Communication and Matrix Computations on Large Message Passing Systems

abstract This paper is concerned with the consequences for matrix computations of having a rather large number of general purpose processors, say ten or twenty thousand, connected in a network in such a way that a processor can communicate only with its immediate neighbors. Certain communication tasks associated with most matrix algorithms are deened and formulas developed for the time required...

A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling

This paper presents a distributed algorithm for the partial precedence constrained scheduling problem. In the classical precedence constrained scheduling problem all the dependent tasks must be scheduled before the task itself can be scheduled. The partial precedence constrained scheduling problem is a generalized version of the original precedence constrained problem in the sense that the numb...

Communication and matrix computations on large message passing systems

abstract This paper is concerned with the consequences for matrix computations of having a rather large number of general purpose processors, say ten or twenty thousand, connected in a network in such a way that a processor can communicate only with its immediate neighbors. Certain communication tasks associated with most matrix algorithms are deened and formulas developed for the time required...

Performance Issues of Message Passing Systems